Conjunctive Query Based Constraint Solving for Feature Model Configuration

Feature model configuration can be supported on the basis of various types reasoning approaches. Examples thereof are SAT solving, constraint and answer set programming (ASP). Using these approaches requires technical expertise how to define solve underlying problem. In this paper, we show apply conjunctive queries typically by today's relational database systems satisfaction problems (CSP) -- more specifically feature tasks. This approach allows application a wide-spread technology tasks also for new algorithmic when it comes identification resolution inconsistencies.